Parallel Transitive Closure and Point Location in Planar Structures
نویسندگان
چکیده
منابع مشابه
Parallel Transitive Closure and Point Location in Planar Structures
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(logn) running time using n= logn processors in the EREW PRAM mod...
متن کاملLower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
We give a number of new lower bounds in the cell probe model with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations. We study the signed prefix sum problem: given a string of length n of 0s and signed 1s, compute the sum of its ith prefix during updates. We show a lower bound of Ω(logn/ log logn) time per opera...
متن کاملAdaptive Planar Point Location
We present a self-adjusting point location structure for convex subdivisions. Let n be the number of vertices in a convex subdivision S. Our structure for S uses O(n) space and processes any online query sequence σ in O(n+ OPT) time, where OPT is the minimum time required by any linear decision tree for answering point location queries in S to process σ. The O(n + OPT) time bound includes the p...
متن کاملData fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In 10] the disconnection set approach has been introduced as an eeective strategy for such a computation. It involves reformulating a transitive closure query on a relation into a number of transitive closure queries on smaller fragments; these queries can then execute inde...
متن کاملA Parallel Algorithm for Transitive Closure
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1991
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0220045